KNNDIST: A Non-Parametric Distance Measure for Speaker Segmentation

نویسندگان

  • Seyed Hamidreza Mohammadi
  • Hossein Sameti
  • Mahsa Sadat Elyasi Langarani
  • Amirhossein Tavanaei
چکیده

A novel distance measure for distance-based speaker segmentation is proposed. This distance measure is nonparametric, in contrast to common distance measures used in speaker segmentation systems, which often assume a Gaussian distribution when measuring the distance betweentwo audio segments. This distance measure is essentially a k-nearestneighbor distance measure. Non-vowel segment removal in preprocessing stage is also proposed. Speaker segmentation performance is tested on artificially created conversations from the TIMIT database and two AMI conversations. For short window lengths, Missed Detection Rated is decreased significantly. For moderate window lengths, a decrease in both Missed Detection and False Alarm Rates occur. The computational cost of the distance measure is high for long window lengths.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving SVF with DISTBIC for Phoneme Segmentation

In this paper we examine an application for phoneme segmentation of DISTBIC, a two-pass, textindependent method traditionally used for speaker segmentation. The novelty of this paper is its experimentation with use of the spectral variation function (SVF), a simple non-parametric method for phone segmentation, as a replacement for the distance measure of the first pass of DISTBIC. In doing so w...

متن کامل

Kernelized Rényi distance for subset selection and similarity scoring

Rényi entropy refers to a generalized class of entropies that have been used in several applications. In this work, we derive a non-parametric distance between distributions based on the quadratic Rényi entropy. The distributions are estimated via Parzen density estimates. The quadratic complexity of the distance evaluation is mitigated with GPUbased parallelization. This results in an efficien...

متن کامل

Audio Indexing Using Speaker Identiication

In this paper, a technique for audio indexing based on speaker identiication is proposed. When speakers are known a priori, a speaker index can be created in real time using the Viterbi algorithm to segment the audio into intervals from a single talker. Segmentation is performed using a hidden Markov model network consisting of interconnected speaker sub-networks. Speaker training data is used ...

متن کامل

Kernelized Rényi distance for speaker recognition

Speaker recognition systems classify a test signal as a speaker or an imposter by evaluating a matching score between input and reference signals. We propose a new information theoretic approach for computation of the matching score using the Rényi entropy. The proposed entropic distance, the Kernelized Rényi distance (KRD), is formulated in a non-parametric way and the resulting measure is eff...

متن کامل

UBM Based Speaker Segmentation and Clustering for 2-Speaker Detection

In this paper, a speaker segmentation method based on log-likelihood ratio score (LLRS) over universal background model (UBM) and a speaker clustering method based on difference of log-likelihood scores between two speaker models are proposed. During the segmentation process, the LLRS between two adjacent speech segments over UBM is used as a distance measure,while during the clustering process...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012